A truthful constant approximation for maximizing the minimum load on related machines
نویسندگان
چکیده
منابع مشابه
A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines
Designing truthful mechanisms for scheduling on related machines is a very important problem in single-parameter mechanism design. We consider the covering objective, that is we are interested in maximizing the minimum completion time of a machine. This problem falls into the class of problems where the optimal allocation can be truthfully implemented. A major open issue for this class is wheth...
متن کاملThe cost of selfishness for maximizing the minimum load on uniformly related machines
Consider the following scheduling game. A set of jobs, each controlled by a selfish agent, are to be assigned to m uniformly related machines. The cost of a job is defined as the total load on the machine that its job is assigned to. A job is interested in minimizing its cost, while the social objective is maximizing the minimum load (cover) over the machines. This goal is different from the re...
متن کاملDeterministic Truthful Approximation Mechanisms for Scheduling Related Machines
We consider the problem of scheduling jobs on parallel related machines owned by selfish agents. We provide deterministic polynomial-time (2 + ǫ)-approximation algorithms and suitable payment functions that yield truthful mechanisms for several NP-hard restrictions of this problem. Up to our knowledge, our result is the first non-trivial polynomial-time deterministic truthful mechanism for this...
متن کاملMaximizing the Minimum Load for Selfish Agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the regular load balancing problem, this problem has not been considered in this context before. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is lin...
متن کاملLower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a length lj and each machine i has a private speed ti. The running time of job j on machine i is tilj . We seek a mechanism that obtains speed bids of machines and then assign jobs and payments to machines so that the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.04.003